منابع مشابه
Random Growth Models with Polygonal Shapes
We consider discrete time random perturbations of monotone cellular automata (CA) in two dimensions. Under general conditions, we prove the existence of half–space velocities, and then establish the validity of the Wulff construction for asymptotic shapes arising from finite initial seeds. Such a shape converges to the polygonal invariant shape of the corresponding deterministic model as the pe...
متن کاملBlending Multiple Polygonal Shapes
Shape blending has several applications in computer graphics. In this paper, we present a new method for smoothly blending among multiple polygonal shapes. The blended shape is computed as a weighted average of the input shapes. The weight of each input shape is allowed to vary across the shape. This feature increases the flexibility for controlling the local appearance of the blended shapes. O...
متن کاملGrowth Models for Shapes
A central problem in computer vision is to detect, delineate (segment) and recognize objects in an image. One reason why this is diicult is that very little information speciic to given types of objects is used during segmentation. Making use of information about an object's shape, for example, should facilitate and improve the segmentation of that object. The thrust of this thesis lies in the ...
متن کاملBlending Polygonal Shapes with Diierent Topologies 1
In this paper we propose a new method for morphing between two polygonal, possibly non-simply-connected, shapes in the plane. The method is based on reconstructing an xy-monotone surface whose extreme cross-sections coincide with the given shapes. The surface generated by our algorithm does not contain any self-intersections, does not change the topologies of the input slices, does not contain ...
متن کاملBlending polygonal shapes with different topologies
In this paper, we propose a new method for morphing between two polygonal, possibly non-simply connected, shapes in the plane. The method is based on reconstructing an xy-monotone surface whose extreme cross-sections coincide with the given shapes. The surface generated by our algorithm does not contain any self-intersections, does not change the topologies of the input slices, does not contain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2006
ISSN: 0091-1798
DOI: 10.1214/009117905000000512